Problems to Be Solved
نویسندگان
چکیده
منابع مشابه
Challenge to Artificial Intelligence: Programming Problems to be Solved
This paper is in the nature of a challenge to a r t i f i c ia l intelligence experts. It suggests that the techniques of a r t i f i c ia l intelligence should be applied to some real ist ic problems which exist in the programming and data processing f ields. After a br ief review of the l i t tle related existing work which has been done, the character ist ics of programming problems which ma...
متن کاملReconstructing Program Theories: Methods Available and Problems to be Solved
This paper discusses methods for reconstructing theories underlying programs and policies. It describes three approaches. One is empirical–analytical in nature and focuses on interviews, documents and argumentational analysis. The second has strategic assessment, group dynamics, and dialogue as its core. The third has cognitive and organizational psychology as its foundation. For each of the th...
متن کاملProblems to be solved if the eradication of tuberculosis is to be realized.
I T WAS only six years ago, at Kansas City, that the American Public Health Association, for the first time, passed a resolution in support of the concept of eradication in the prevention of communicable diseases. In the six years that have elapsed since the first acceptance of eradication we have advanced such a tremendous distance that it is now possible to discuss the eradication of such a d...
متن کاملComputational Problems that can be Solved Without Computation
The paper discusses various optimization problems that look fairly difficult at first sight, but in fact are trivial to solve. Here the word ‘trivial’ means that there exist primitive computer programs for these problems whose behavior hardly depends on the input data. Among the discussed problems are: Minimizing the failure probability in a cyclic double-loop system; the travelling salesman pr...
متن کاملWhich Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics of DynCSPs and DynCOPs, not all algorithms perform equally well on all problems. In this paper, we present the Dynamic Constraint Optimization Ant Algorithm (DynCOAA). It is based upon the ant colony optimization (ACO) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRENDS IN THE SCIENCES
سال: 2011
ISSN: 1884-7080,1342-3363
DOI: 10.5363/tits.16.2_50